#include"Tree.h"   
#include"Queue.h"
void TreeLevelOrder(BTNode* root)
{
	Queue q;
	QueuePush(root, &q);
	

}
int main()
{
	BTNode* root = CreatTree();
	
	BinaryTreePrevOrder(root);
	//printf("\n");
	//BinaryTreeInOrder(root);
	//printf("\n");
	//BinaryTreePostOrder(root);
	//printf("\n");

	//printf("BinaryTreeSize :%d\n", BinaryTreeSize(root));
	//printf("BinaryTreeLeafSize :%d\n", BinaryTreeLeafSize(root));
	//printf("BinaryTreeHeight :%d\n", BinaryTreeHeight(root));
	//printf("BinaryTreeLevelKSize :%d\n", BinaryTreeLevelKSize(root,3));
	return 0;
}